Queue Tests for Renewal Processes
نویسنده
چکیده
In many operations research applications we want to know if a stochastic point process (series of events) can be modeled as a renewal process or a Poisson process. In other words, we want to know if the intervals between points are approximately lid (independent and identically distributed) and, if so, whether they are approximately exponentially distributed. For example, we may be considering arrivals to a queue, demands for inventory, or the occurrence of failures. Whether we start with data from a physical system or a mathematical model we want to know if the point process can be modeled as a renewal process or a Poisson process. Then we can do further work with a more elementary analytic model or a more elementary simulation. Of course, there are standard ways to analyze these problems. With data, we can apply standard statistical tests for renewal processes and Poisson processes; see Cox and Lewis [6, Chapter 6]. With mathematical models, we can do further analysis to see whether the point process of interest is actually renewal or Poisson; e.g., Disney, Farrel and DeMorais [7] and Melamed [I i] have characterized when flows in a network of queues are renewal or Poisson. Alternatively, with mathematical models we can simulate, collect data and then perform the standard statistical tests. The purpose of this paper is to suggest a different approach. We suggest using a queuing model to test whether a point process can be adequately modeled as a renewal process or a Poisson process. (This may be in addition to other statistical tests.) The idea is to analyze the queuing model using the process of interest to generate the arrivals (or the service times). If we have data, then we use that data to generate arrivals to the queue in a simulation; otherwise, we either solve the queuing model analytically or simulate it. Then we compare vari. ous congestion measures with theoretical results in the case of a renewal or Poisson arrival process. In this approach, the queuing model is an artificial device introduced to perform the test. The actual application may have nothing to do with queues. Even though we consider only queuing models, other models (e.g., inventory and reliability) could also be used to perform the tests. Obviously, however, it Should be desirable to perform the test with a model closely related to the intended application. To make the motivation clear, consider the case of a stationary departure process from an M / G / I queue in equilibrium. The theory may demonstrate that the process is actually not renewal [7]. However, in many applications we will be satisfied if the process is only approximately renewal. Of course, we can apply the standard statistical tests, but how should we interpret the results? With enough data, we would reject the renewal hypothesis. Obviously what matters is how the de-
منابع مشابه
ANALYSIS OF RENEWAL INPUT STATE DEPENDENT VACATION QUEUE WITH $N$-POLICY
This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical computations in the form of graphs are presented to show the par...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملSecond Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کاملON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION
This paper analyzes a renewal input working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a
متن کاملStationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals
The problem considered is that of estimating the tail stationary probability for two exponential server queues in series fed by renewal arrivals. We compute the tail of the marginal queue length distribution at the second queue. The marginal at the first queue is known by the classical result for the GI/M/1 queue. The approach involves deriving necessary and sufficient conditions on the paths o...
متن کامل